Finite Atmospheres with Isotropic Scattering: III. Corrigendum and Addendum
نویسندگان
چکیده
منابع مشابه
Corrigendum and addendum to: Linearly recurrent subshifts have a finite number of non-periodic factors
We prove that a subshift (X, T ) is linearly recurrent if and only if it is a primitive and proper S-adic subshift. This corrects Proposition 6 in F. Durand (Ergod. Th. & Dynam. Sys. 20 (2000), 1061–1078).
متن کاملIsotropic Matroids III: Connectivity
The isotropic matroid M [IAS(G)] of a graph G is a binary matroid, which is equivalent to the isotropic system introduced by Bouchet. In this paper we discuss four notions of connectivity related to isotropic matroids and isotropic systems. We show that the isotropic system connectivity defined by Bouchet is equivalent to vertical connectivity of M [IAS(G)], and if G has at least four vertices,...
متن کاملAddendum to: Finite Variable Logics
8. p 133, k-variable property. Related results are given in the paper On bounded theories by J. Flum (in Proc. Computer Science Logic 91, Berne, eds. E. Boerger, G. Jaeger, H. Kleine Buening, M.M. Richter, Springer LNCS 626, 111–118). There, a first-order theory T in signature L is said to be k-bounded if (essentially) every first-order L-formula is T -equivalent to one where at most k distinct...
متن کاملRendering Parametrizable Planetary Atmospheres with Multiple Scattering in Real-Time
In the field of physically-based rendering of natural phenomena, rendering of atmospheric light scattering takes a very important place. Real-time rendering of the sky and planetary atmospheres in general is essential for all outdoor computer games, various simulators, virtual worlds and even for animated movies. In our work we present an accurate and fast method for real-time rendering of para...
متن کاملAddendum to "Factoring polynomials over finite fields with Drinfeld modules"
After my paper [2] was electronically published by Mathematics of Computation, I came across the PhD thesis of professor I. Y. Potemine [6]. In Section 4.3 of his thesis, an algorithm for factoring polynomials is proposed which is equivalent to the algorithm discussed in my paper. Potemine’s algorithm is acknowledged in my PhD thesis [1]. Our algorithms were found independently, both as analogu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 1957
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/117.5.516